f(a, h(x)) → f(g(x), h(x))
h(g(x)) → h(a)
g(h(x)) → g(x)
h(h(x)) → x
↳ QTRS
↳ DependencyPairsProof
f(a, h(x)) → f(g(x), h(x))
h(g(x)) → h(a)
g(h(x)) → g(x)
h(h(x)) → x
F(a, h(x)) → F(g(x), h(x))
H(g(x)) → H(a)
G(h(x)) → G(x)
F(a, h(x)) → G(x)
f(a, h(x)) → f(g(x), h(x))
h(g(x)) → h(a)
g(h(x)) → g(x)
h(h(x)) → x
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
F(a, h(x)) → F(g(x), h(x))
H(g(x)) → H(a)
G(h(x)) → G(x)
F(a, h(x)) → G(x)
f(a, h(x)) → f(g(x), h(x))
h(g(x)) → h(a)
g(h(x)) → g(x)
h(h(x)) → x
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
G(h(x)) → G(x)
f(a, h(x)) → f(g(x), h(x))
h(g(x)) → h(a)
g(h(x)) → g(x)
h(h(x)) → x
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
G(h(x)) → G(x)
The value of delta used in the strict ordering is 1/16.
POL(h(x1)) = 1/4 + (2)x_1
POL(G(x1)) = (1/4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
f(a, h(x)) → f(g(x), h(x))
h(g(x)) → h(a)
g(h(x)) → g(x)
h(h(x)) → x
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
F(a, h(x)) → F(g(x), h(x))
f(a, h(x)) → f(g(x), h(x))
h(g(x)) → h(a)
g(h(x)) → g(x)
h(h(x)) → x
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(a, h(x)) → F(g(x), h(x))
The value of delta used in the strict ordering is 3/4.
POL(a) = 4
POL(g(x1)) = 1
POL(h(x1)) = 0
POL(F(x1, x2)) = (1/4)x_1
g(h(x)) → g(x)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
f(a, h(x)) → f(g(x), h(x))
h(g(x)) → h(a)
g(h(x)) → g(x)
h(h(x)) → x